Blocking Sets in (v, {2, 4}, 1)-Designs
نویسندگان
چکیده
The existence of blocking sets in (v, {2, 4}, 1)-designs is examined. We show that for v ≡ 0, 3, 5, 6, 7, 8, 9, 11 (mod 12), blocking sets cannot exist. We prove that for each v ≡ 1, 2, 4 (mod 12) there is a (v, {2, 4}, 1)-design with a blocking set with three possible exceptions. The case v ≡ 10 (mod 12) is still open; we consider the first four values of v in this situation.
منابع مشابه
Blocking sets in handcuffed designs
In this paper we determine the spectrum of possible cardinalities of a blocking set in a H(v,3,A) and in a H(v,4,1). Moreover we construct, for each admissible ~9, a H(v,3,1) without blocking sets. Introduction A handcuffed design with parameters v, k, A, or for short an H(v,k,A), consists of a set of ordered k-subsets of a v-set, called handcuffed blocks. In a block (a., a z ' ... ,a!:) each e...
متن کاملG-designs without blocking sets, Note
For an undirected graph G and a natural number n, a G-design of order n is an edge partition of the complete graph Kn with n vertices into subgraphs G1, G2, . . . , each isomorphic to G. A set T ⊂ V (Kn) is called a blocking set if it meets the vertex set V (Gi) of each Gi in the decomposition, but contains none of them. In a previous paper [J. Combin. Designs 4 (1996), 135–142] the first and t...
متن کاملOn Minimal Defining Sets of Full Designs and Self-Complementary Designs, and a New Algorithm for Finding Defining Sets of t-Designs
A defining set of a t-(v, k, λ) design is a partial design which is contained in a unique t-design with the given parameters. A minimal defining set is a defining set, none of whose proper partial designs is a defining set. This paper proposes a new and more efficient algorithm that finds all non-isomorphic minimal defining sets of a given t-design. The complete list of minimal defining sets of...
متن کاملBlocking sets in balanced path designs
Let k ~ 3. For each admissible v, we determine the set BS1i ( v, k, 1) of integers x such that there exists a balanced path design H ( v, k, 1) with a blocking set of cardinality x.
متن کاملBlock Transitive Resolutions of t - designs andRoom
By a resolution of t-designs we mean a partition of the trivial design ? X k of all k-subsets of a v-set X into t ? (v 0 ; k;) designs, where v 0 v. A resolution of t-designs with v = v 0 is also called a large set of t-designs. A Room rectangle R, based on ? X k , is a rectangular array whose non-empty entries are k-sets. This array has the further property that taken together the rows form a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Des. Codes Cryptography
دوره 10 شماره
صفحات -
تاریخ انتشار 1997